skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 1

Search for: All records

Creators/Authors contains: "Henry L. Fleischmann*, Steven J."

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. (, AUSTRALASIAN JOURNAL OF COMBINATORICS)
    Let P(k) denote the largest size of a non-collinear point set in the plane admitting at most k distinct angles. We prove P(2) = P(3) = 5, and we characterize the optimal sets. We also leverage results from Fleischmann et al. [Disc. Comput. Geom. (2023)] to provide the general bounds k+2 ≤ P(k) ≤ 6k, although the upper bound may be improved pending progress toward the Strong Dirac Conjecture. We conjecture that the lower bound is tight, providing infinite families of configurations meeting the bound and ruling out several classes of potential counterexamples. 
    more » « less
    Accepted Manuscript Full Text Available